全文获取类型
收费全文 | 5657篇 |
免费 | 429篇 |
国内免费 | 350篇 |
专业分类
化学 | 333篇 |
晶体学 | 16篇 |
力学 | 72篇 |
综合类 | 139篇 |
数学 | 5467篇 |
物理学 | 409篇 |
出版年
2024年 | 10篇 |
2023年 | 105篇 |
2022年 | 149篇 |
2021年 | 136篇 |
2020年 | 206篇 |
2019年 | 237篇 |
2018年 | 232篇 |
2017年 | 204篇 |
2016年 | 128篇 |
2015年 | 108篇 |
2014年 | 194篇 |
2013年 | 475篇 |
2012年 | 204篇 |
2011年 | 330篇 |
2010年 | 320篇 |
2009年 | 486篇 |
2008年 | 419篇 |
2007年 | 321篇 |
2006年 | 364篇 |
2005年 | 239篇 |
2004年 | 215篇 |
2003年 | 178篇 |
2002年 | 172篇 |
2001年 | 165篇 |
2000年 | 145篇 |
1999年 | 142篇 |
1998年 | 126篇 |
1997年 | 83篇 |
1996年 | 54篇 |
1995年 | 54篇 |
1994年 | 41篇 |
1993年 | 31篇 |
1992年 | 28篇 |
1991年 | 19篇 |
1990年 | 15篇 |
1989年 | 17篇 |
1988年 | 15篇 |
1987年 | 10篇 |
1986年 | 5篇 |
1985年 | 13篇 |
1984年 | 12篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6436条查询结果,搜索用时 15 毫秒
11.
《Discrete Mathematics》2019,342(2):339-343
A strong edge-coloring of a graph is a partition of its edge set into induced matchings. Let be a connected planar graph with girth and maximum degree . We show that either is isomorphic to a subgraph of a very special -regular graph with girth , or has a strong edge-coloring using at most colors. 相似文献
12.
In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper. 相似文献
13.
We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
14.
15.
16.
Lubomir Spanhel 《Journal of Sol-Gel Science and Technology》2006,39(1):7-24
The past research work devoted to ZnO nanocolloidal sol-gel route is reviewed. It highlights the cluster chemistry of alcoholic
ZnAc2 solutions and the results of ZnO colloid growth investigations performed worldwide. Moreover, the role of doping and co-doping
in the processing of functional ZnO coatings is discussed. The possibilities of tuning the optical properties are also reported
with a particular attention to luminescence. The last part of this paper deals with electrical and photoelectrochemical properties
of ZnO nanocrystals and their aggregates.
This contribution is dedicated to the 80th birthday of Prof. Arnim Henglein from the Hahn-Meitner-Institut in Berlin and to
the memory of Prof. Jacques Mugnier from the Université Claude-Bernard Lyon 1 in France. 相似文献
17.
用Java实现网上结构图实验仿真 总被引:2,自引:0,他引:2
基于线性系统仿真的连接矩阵方法,用Java语言开发面向结构图的实验仿真程序,以Applet小应用程序的形式插入网页中运行,实现了信号与系统网上实验教学中的结构图实验仿真。经试用,程序在浏览器中运行正常,可以完成一般线性系统仿真,与以MATLAB,LABView等程序开发的实验仿真程序相比,该程序运行环境简单,几乎所有常用的Web浏览器都支持Java运行,不需另行安装相应组件。对于线性系统结构图,实现了所见即所得的图形化编程环境,具有较好的人机交互性。 相似文献
18.
Mathematical Notes - 相似文献
19.
A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed. 相似文献
20.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献